A Kriging-based Unconstrained Global Optimization Algorithm
نویسنده
چکیده
Efficient Global Optimization (EGO) algorithm with Kriging model is stable and effective for an expensive black-box function. However, How to get a more global optimal point on the basis of surrogates has been concerned in simulation-based design optimization. In order to better solve a black-box unconstrained optimization problem, this paper introduces a new EGO method named improved generalized EGO (IGEGO), in which two targets will be achieved: using Kriging surrogate model and guiding the optimal searching direction into more promising regions. Kriging modeling which can fast construct an approximation model is the premise of performing optimization. Next, a new infill sampling criterion (ISC) called improved generalized expected improvement which round off Euclidean norm on variation of the optimal solutions of parameter θ to replace parameter g can effectively balance global and local search in IGEGO method. Twelve numerical tests and an engineering example are given to illustrate the reliability, applicability and effectiveness of the present method.
منابع مشابه
A new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملSolving the Unconstrained Optimization Problems Using the Combination of Nonmonotone Trust Region Algorithm and Filter Technique
In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems that is equipped with the filter technique. In the proposed method, the various nonmonotone technique is used. Using this technique, the algorithm can advantage from nonmonotone properties and it can increase the rate of solving the problems. Also, the filter that is used in...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملeTSSO: Adaptive Search Method for Stochastic Global Optimization Under Finite Budget
TSSO is a recently proposed search algorithm based on the modified nugget effect kriging metamodel, which solves unconstrained stochastic simulation optimization problems with heterogeneous variances, when the total simulation budget is fixed, through a budget allocation followed by a two–stage sequential procedure. Despite the efficiency and performance of TSSO, no analysis of the structural p...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کامل